Incremental Learning of TBoxes from Interpretation Sequences with Methods of Formal Concept Analysis
نویسنده
چکیده
Formal Concept Analysis and its methods for computing minimal implicational bases have been successfully applied to axiomatise minimal ELTBoxes from models, so called bases of GCIs. However, no technique for an adjustment of an existing EL-TBox w.r.t. a new model is available, i.e., on a model change the complete TBox has to be recomputed. This document proposes a method for the computation of a minimal extension of a TBox w.r.t. a new model. The method is then utilised to formulate an incremental learning algorithm that requires a stream of interpretations, and an expert to guide the learning process, respectively, as input.
منابع مشابه
Electronic Non Formal Education: A Case Study of Tehran Municipality
Considering the emergence of brand-new educational needs, non-formal education as a prerequisite of a knowledge-based society is increasingly going popular among nations in view of its continual nature. However, life-long learning as a key concept of the modern education system stands clearly at odds with traditional learning in every way of philosophy, objectives,...
متن کاملExact Learning of TBoxes in EL and DL-Lite
We study polynomial time learning of description logic TBoxes in Angluin et al.’s framework of exact learning via queries. We admit entailment queries (“is a given subsumption entailed by the target TBox?”) and equivalence queries (“is a given TBox equivalent to the target TBox?”), assuming that the signature and logic of the target TBox are known. We present three main results: (1) TBoxes form...
متن کاملThe Effect of Concept Map on Education: A Systematic Review
Introduction: Along with science and technology advancement, philosophy, content and educational methods are transforming. Modern approaches such as constructivism have replaced traditional approaches and the assumption of knowledge transfer from teachers to learners. One of these approaches is concept map. The purpose of this paper was to examine the application of concept maps in education an...
متن کاملExact Learning of Lightweight Description Logic Ontologies
We study learning of description logic TBoxes in Angluin et al.’s framework of exact learning via queries. We admit entailment queries (“is a given subsumption entailed by the target TBox?”) and equivalence queries (“is a given TBox equivalent to the target TBox?”), assuming that the signature and logic of the target TBox are known. We present three main results: (1) TBoxes formulated in DL-Lit...
متن کاملIDS: An Incremental Learning Algorithm for Finite Automata
We present a new algorithm IDS for incremental learning of deterministic finite automata (DFA). This algorithm is based on the concept of distinguishing sequences introduced in [1]. We give a rigorous proof that two versions of this learning algorithm correctly learn in the limit. Finally we present an empirical performance analysis that compares these two algorithms, focussing on learning time...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015